Single-Shot Error Correction of Three-Dimensional Homological Product Codes

نویسندگان

چکیده

The conditions for the robustness of quantum codes against unreliable measurements are explored: A strict criterion is provided, as well benchmarks and conceptual tools needed building practical devices.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantum Error-Correction Codes on Abelian Groups

We prove a general form of bit flip formula for the quantum Fourier transform on finite abelian groups and use it to encode some general CSS codes on these groups.

متن کامل

Single-Shot Fault-Tolerant Quantum Error Correction

Single-Shot Fault-Tolerant Quantum Error Correction Bombin Palomo, Hector Published in: Physical Review X DOI: 10.1103/PhysRevX.5.031043 Publication date: 2015 Document Version Publisher's PDF, also known as Version of record Citation for published version (APA): Bombin Palomo, H. (2015). Single-Shot Fault-Tolerant Quantum Error Correction. Physical Review X, 5(3), [031043]. DOI: 10.1103/PhysRe...

متن کامل

Low-cost single error correction multiple adjacent error correction codes

Soft errors that affect flip-flops are a major issue in advanced electronic circuits. As technology scales, multiple bit errors become more likely. This limits the applicability of traditional protection techniques like triplication with voting or single error correction codes that can correct only one error. Multiple errors tend to affect adjacent bits, and therefore it is interesting to use e...

متن کامل

Homological Error Correcting Codes and Systolic Geometry

In my masters thesis I prove a square root bound on the distance of homological codes that come from two dimensional surfaces, as a result of the systolic inequality. I also give a detailed version of M.H. Freedman's proof that due to systolic freedom, this bound does not hold in higher dimensions.

متن کامل

Optimal codes for single-error correction, double-adjacent-error detection

In certain memory systems the most common error is a single error and the next most common error is two errors in positions which are stored physically adjacent in the memory. In this correspondence we present optimal codes for recovering from such errors. We correct single errors and detect double adjacent errors. For detecting adjacent errors we consider codes which are byte-organized. In the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: PRX quantum

سال: 2021

ISSN: ['2691-3399']

DOI: https://doi.org/10.1103/prxquantum.2.020340